Finding Matrices that Satisfy Functional Equations
نویسندگان
چکیده
منابع مشابه
Partly Zero Eigenvectors and Matrices That Satisfy Au=b
For given vectors u; b 2 F n (where F is a eld with at least 3 elements), we establish criteria for deciding whether a digraph allows in its pattern class a matrix A which satisses Au = b: As corollaries to this we give necessary and suucient conditions for a pattern class to allow a matrix which has an eigenvector with a particular zero/nonzero pattern. Moreover we establish whether or not tha...
متن کاملM-matrices Satisfy Newton’s Inequalities
Newton’s inequalities cn ≥ cn−1cn+1 are shown to hold for the normalized coefficients cn of the characteristic polynomial of any Mor inverse M-matrix. They are derived by establishing first an auxiliary set of inequalities also valid for both of these classes. They are also used to derive some new necessary conditions on the eigenvalues of nonnegative matrices.
متن کاملA Method for Finding Independently Distributed Probability Models that Satisfy Order Contraints
This research investigates a method that attempts to represent a database of expert decisions as an independent probability distribution. To implement this representation, our method searches for a simple probability model that exhibits maximum independence property and preserves a given set of inequality constraints. We will show that nding such a representation can be formulated as a search p...
متن کاملDo All Integrable Equations Satisfy Integrability Criteria?
1 Laboratoire Imagerie et Modélisation en Neurobiologie et Cancérologie (IMNC), CNRS UMR 8165, Université Paris VII-Paris XI, Bâtiment 104, 91406 Orsay, France 2 Centre de Physique Théorique, École Polytechnique, CNRS, 91128 Palaiseau, France 3Department of Mathematics, Pondicherry University, Kalapet, Puducherry 605014, India 4Department of Mathematics, Kanchi Mamunivar Centre for Postgraduate...
متن کاملAlgorithms that satisfy a stopping criterion, probably
Iterative numerical algorithms are typically equipped with a stopping criterion, where the iteration process is terminated when some error or misfit measure is deemed to be below a given tolerance. This is a useful setting for comparing algorithm performance, among other purposes. However, in practical applications a precise value for such a tolerance is rarely known; rather, only some possibly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The College Mathematics Journal
سال: 2009
ISSN: 0746-8342,1931-1346
DOI: 10.4169/193113409x458769